Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
نویسندگان
چکیده
منابع مشابه
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a finite set of terms with variables, where each variable is restricted to instantiations of a regular set given by a tree automaton. The problem was recently proved decidable, but with an unknown complexity. Here, the e...
متن کاملa study of translation of english litrary terms into persian
چکیده هدف از پژوهش حاضر بررسی ترجمه ی واژه های تخصصی حوزه ی ادبیات به منظور کاوش در زمینه ی ترجمه پذیری آنها و نیز راهکار های به کار رفته توسط سه مترجم فارسی زبان :سیامک بابایی(1386)، سیما داد(1378)،و سعید سبزیان(1384) است. هدف دیگر این مطالعه تحقیق در مورد روش های واژه سازی به کار رفته در ارائه معادل های فارسی واژه های ادبی می باشد. در راستای این اهداف،چارچوب نظری این پژوهش راهکارهای ترجمه ار...
15 صفحه اولa cross-comparative dtudy between two textbook series in terms of the presentation of politeness
چکیده ندارد.
15 صفحه اولa synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2011
ISSN: 0097-5397,1095-7111
DOI: 10.1137/090777669